﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion

using NStl.Iterators.Support;
using NStl.Linq;
using System.Collections.Generic;
using NStl.Collections;
using NUnit.Framework;
using System.Collections;

namespace NStl.NUnit.AlgorithmFixtures.SetSymmetricDifference
{
    [TestFixture]
    public class SetSymmetricDifferenceFixture : AlgorithmBaseFixture
    {
        [Test]
        public override void SuccessfullPass()
        {
            LinkedList<int>  src1    = new LinkedList<int> (new[]{-1, 0, 1, 2, 3, 4});
            List<int> src2 = new List<int> {-3, -2, -1, 0};
            List<int> target = new List<int> {0,0,0,0,0,0};
            
            ListTIterator<int> endOfInsertion =
                Algorithm.SetSymmetricDifference(src1.Begin(), src1.End(), src2.Begin(), src2.End(), 
                                                 target.Begin());

            ICollection targetRange = target.Begin().AsCollection(endOfInsertion);
            ICollection expected = new[] {-3, -2, 1, 2, 3, 4};
            Assert.AreEqual(target.End(), endOfInsertion);
            CollectionAssert.AreEqual(expected, targetRange);
        }

        [Test]
        public override void NonSuccessfullPass()
        {
            LinkedList<int> src1 = new LinkedList<int>(new[]{-1, 0, 1, 2, 3, 4});
            List<int> src2 = new List<int> {-1, 0, 1, 2, 3, 4};
            List<int> target = new List<int> ();

            ListTIterator<int> endOfInsertion =
                Algorithm.SetSymmetricDifference(src1.Begin(), src1.End(), src2.Begin(), src2.End(),
                                                 target.Begin());

            ICollection targetRange = target.Begin().AsCollection(endOfInsertion);
            Assert.AreEqual(target.End(), endOfInsertion);
            CollectionAssert.IsEmpty(targetRange);
        }
        [Test]
        public void FirstRangeDiffersFromSecondButSecondNotFromFirst()
        {
            LinkedList<int> src1 = new LinkedList<int>(new[] { -1, 0 });
            List<int> src2 = new List<int> {-3, -2, -1, 0};
            List<int> target = new List<int> ();
            target.Resize(55);

            Assert.AreNotEqual(src1.Begin(), src1.End());
            ListTIterator<int> endOfInsertion =
                Algorithm.SetSymmetricDifference(src1.Begin(), src1.End(), src2.Begin(), src2.End(),
                                                 target.Begin());

            
            ICollection targetRange = target.Begin().AsCollection(endOfInsertion);
            ICollection expected = new[] {-3, -2};
            CollectionAssert.AreEqual(expected, targetRange);
        }
        [Test]
        public void SecondRangeDiffersFromFirstButFirstNotFromSecond()
        {
            LinkedList<int> src1 = new LinkedList<int>(new[]{-1, 0, 1, 2, 3, 4});
            List<int> src2 = new List<int> {-1, 0};
            List<int> target = new List<int> ();
            target.Resize(55);

            Assert.AreNotEqual(src1.Begin(), src1.End());
            ListTIterator<int> endOfInsertion =
                Algorithm.SetSymmetricDifference(src1.Begin(), src1.End(), src2.Begin(), src2.End(),
                                                 target.Begin());


            ICollection targetRange = target.Begin().AsCollection(endOfInsertion);
            ICollection expected = new[] {1, 2, 3, 4};
            CollectionAssert.AreEqual(expected, targetRange);
        }
        [Test]
        public override void StartIteratorIsEqualToEndIterator()
        {
            LinkedList<int> src1 = new LinkedList<int>(new[]{-1, 0, 1, 2, 3, 4});
            List<int> src2 = new List<int> {-3, -2, -1, 0};
            List<int> target = new List<int>();
            target.Resize(55);

            ListTIterator<int> endOfInsertion =
                Algorithm.SetSymmetricDifference(src1.Begin(), src1.Begin(), src2.Begin(), src2.End(),
                                                 target.Begin());

            ICollection targetRange = target.Begin().AsCollection(endOfInsertion);
            ICollection expected = new[] { -3, -2, -1, 0 };
            CollectionAssert.AreEqual(expected, targetRange);
        }
        [Test]
        public void SecondStartIteratorIsEqualToSecondEndIterator()
        {
            LinkedList<int> src1 = new LinkedList<int>(new[]{-1, 0, 1, 2, 3, 4});
            List<int> src2 = new List<int> {-3, -2, -1, 0};
            List<int> target = new List<int>();
            target.Resize(55);

            ListTIterator<int> endOfInsertion =
                Algorithm.SetSymmetricDifference(src1.Begin(), src1.End(), src2.Begin(), src2.Begin(),
                                                 target.Begin());

            ICollection targetRange = target.Begin().AsCollection(endOfInsertion);
            ICollection expected = new[] { -1, 0, 1, 2, 3, 4 };
            CollectionAssert.AreEqual(expected, targetRange);
        }
    }
}
